Combinatorial programming, statistical optimization and the optimal transportation network problem
نویسندگان
چکیده
منابع مشابه
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملStatistical physics of hard combinatorial optimization: The vertex cover problem
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper we use the vertex cover probl...
متن کاملThe Monge Optimal Transportation Problem
We report here two recent developments in the theory of optimal transportation. The first is a proof for the existence of optimal mappings to the Monge mass transportation problem [16]. The other is an application of optimal transportation in geometric optics [19]. The optimal transportation problem, in general, deals with the redistribution of materials in the most economical way. The original...
متن کاملSemideenite Programming and Combinatorial Optimization
Semideenite Programs have recently turned out to be a powerful tool for approximating integer problems. To survey the development in this area over the last few years, the following topics are addressed in some detail. First, we investigate ways to derive semideenite programs from discrete optimization problems. The duality theory for semideenite programs is the key to understand algorithms to ...
متن کاملCombinatorial Optimization and Integer Linear Programming Combinatorial Optimization
Examples: Shortest Path, Traveling Salesman, and many many more. . . Just in bioinformatics: Alignments, Threading, Clone-Probe Mapping, Probe Selection, De Novo Peptide Sequencing, SideChain Placement, Maximum-weight Connected Subgraph in PPI Networks, Genome Rearrangements, Cluster Editing, Finding Regulatory Modules, Finding Approximate Gene Clusters, Haplotyping, and many more. . . Example....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 1982
ISSN: 0191-2615
DOI: 10.1016/0191-2615(82)90030-3